The Extendability of Matchings in Strongly Regular Graphs
نویسندگان
چکیده
منابع مشابه
The Extendability of Matchings in Strongly Regular Graphs
A graph G of even order v is called t-extendable if it contains a perfect matching, t < v/2 and any matching of t edges is contained in some perfect matching. The extendability of G is the maximum t such that G is t-extendable. In this paper, we study the extendability properties of strongly regular graphs. We improve previous results and classify all strongly regular graphs that are not 3-exte...
متن کاملMax-cut and extendability of matchings in distance-regular graphs
A connected graph G of even order v is called t-extendable if it contains a perfect matching, t < v/2 and any matching of t edges is contained in some perfect matching. The extendability of G is the maximum t such that G is t-extendable. Since its introduction by Plummer in the 1980s, this combinatorial parameter has been studied for many classes of interesting graphs. In 2005, Brouwer and Haem...
متن کاملRandom Matchings in Regular Graphs
For a simple d-regular graph G, let M be chosen uniformly at random from the set of all matchings of G, and for x ∈ V (G) let p(x) be the probability that M does not cover x. We show that for large d, the p(x)’s and the mean μ and variance σ of |M | are determined to within small tolerances just by d and (in the case of μ and σ) |V (G)|: Theorem For any d-regular graph G, (a) p(x) ∼ d ∀x ∈ V (G...
متن کاملRegular Star Complements in Strongly Regular Graphs
We prove that, aside from the complete multipartite graphs and graphs of Steiner type, there are only finitely many connected strongly regular graphs with a regular star complement of prescribed degree s ∈ IN . We investigate the possible parameters when s ≤ 5. AMS Classification: 05C50
متن کاملStrongly maximal matchings in infinite weighted graphs
Given an assignment of weights w to the edges of an infinite graph G, a matching M in G is called strongly w-maximal if for any matching N there holds ∑ {w(e) | e ∈ N \ M} ≤ ∑ {w(e) | e ∈ M \ N}. We prove that if w assumes only finitely many values all of which are rational then G has a strongly w-maximal matching. This result is best possible in the sense that if we allow irrational values or ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/4142